General Interior-Point Maps and Existence of Weighted Paths for Nonlinear Semidefinite Complementarity Problems

نویسندگان

  • Renato D. C. Monteiro
  • Paulo R. Zanjácomo
چکیده

Extending the previous work of Monteiro and Pang (1998), this paper studies properties of fundamental maps that can be used to describe the central path of the monotone nonlinear complementarity problems over the cone of symmetric positive semidefinite matrices. Instead of focusing our attention on a specific map as was done in the approach of Monteiro and Pang (W98), this paper considers a general form of a fundamental map and introduces conditions on the map that allow us to extend the main resulis of Monteiro and Pang (1998) to this general map. Eaeh fundamental map leads to a family of "weighted" continuous trajectories which include the central trajectory as a special case. Hence, for complementarity problems over the cone of symmetric positive semidefinite matrices, the notion of weighted central path depends on the fundamental map used to represent the central path.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Two Interior-Point Mappings for Nonlinear Semidefinite Complementarity Problems

Extending our previous work Monteiro and Pang (1996), this paper studies properties of two fundamental mappings associated with the family of interior-point methods for solving monotone nonlinear complementarity problems over the cone of symmetric positive semideenite matrices. The rst of these maps lead to a family of new continuous trajectories which include the central trajectory as a specia...

متن کامل

Improved infeasible-interior-point algorithm for linear complementarity problems

We present a modified version of the infeasible-interior- We present a modified version of the infeasible-interior-point algorithm for monotone linear complementary problems introduced by Mansouri et al. (Nonlinear Anal. Real World Appl. 12(2011) 545--561). Each main step of the algorithm consists of a feasibility step and several centering steps. We use a different feasibility step, which tar...

متن کامل

Limiting behavior of the Alizadeh-Haeberly-Overton weighted paths in semidefinite programming

This paper studies the limiting behavior of weighted infeasible central paths for semidefinite programming obtained from centrality equations of the form XS + SX = 2νW , where W is a fixed positive definite matrix and ν > 0 is a parameter, under the assumption that the problem has a strictly complementary primal–dual optimal solution. We present a different and simpler proof than the one given ...

متن کامل

High-order long-step methods for solving semidefinite linear complementarity problems

The authors studied in Preiß and Stoer (2003) the analyticity properties of infeasible-interior-point paths encountered in the context of semidefinite linear complementarity problems. It will be shown that these results allow for the design of infeasibleinterior-point methods of long-step type with an arbitrarily high order of local convergence for solving such problems.

متن کامل

Asymptotic Behavior of Underlying NT Paths in Interior Point Methods for Monotone Semidefinite Linear Complementarity Problems

An interior point method (IPM) defines a search direction at each interior point of the feasible region. These search directions form a direction field, which in turn gives rise to a system of ordinary differential equations (ODEs). Thus, it is natural to define the underlying paths of the IPM as solutions of the system of ODEs. In [32], these off-central paths are shown to be well-defined anal...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Math. Oper. Res.

دوره 25  شماره 

صفحات  -

تاریخ انتشار 2000